Existence of balanced incomplete block designs for many sets of treatments

Existence of balanced incomplete block designs for many sets of treatments

A range of methods is presented for the recursive construction of sets of orthogonal balanced incomplete block designs. To enable these methods, some new types of designs are de1ned. Some examples of these are given, and pairs of orthogonal BIBDs constructed for k =3; =2, for all but 12 values of v where v ≡ 0; 1 (mod 3) with v¿ 6. c © 2002 Elsevier Science B.V. All rights reserved.

Splitting balanced incomplete block designs

Remarks on Balanced Incomplete Block Designs

Proof. Assume the hypothesis and the falsity of either conclusion. Construct matrix A of 2x + 2 rows and 4x+4 columns, with entries + 1 and — 1. The first column contains exclusively +1, and the second column — 1. Set up one-to-one correspondences between rows of A and elements of D ; between columns other than the first two of A and blocks of D. Enter +1 if the element is contained in the bloc...

Finding Balanced Incomplete Block Designs with Metaheuristics

This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulated as a combinatorial optimization problem (COP) whose solutions are binary matrices. Two different neighborhood structures are defined, based on bit-flipping and position-swapping. These are used within three metaheu...

Beautifully Ordered Balanced Incomplete Block Designs

Beautifully Ordered Balanced Incomplete Block Designs, BOBIBD(v, k, λ, k1, λ1), are defined and the proof is given to show that necessary conditions are sufficient for the existence of BOBIBD with block size k=3 and k1=2 and for k=4 and k1=2 except possibly for eleven exceptions. Existence of BOBIBDs with block size k=4 and k1=3 is demonstrated for all but one infinite family and the non-existe...